1·Bipartite Graph is important data structure for data base system etc.
二部图是数据库等应用系统的重要的数据结构。
2·A complete bipartite graph is a simple bipartite graph with bipartition.
完全偶图是具有二分类的简单偶图。
3·The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
得到了扇和完全等二部图联图的边色数。
4·The architecture is represented by a bipartite graph and its relation with a general graph is also discussed.
文中用两类节点的二分图表示所提出的网络结构，并讨论了其与一般图表示方法问的关系。
5·This scheduling algorithm takes the bipartite graph matching and the backtracking techniques as mathematical tools.
该算法以偶图匹配、回溯技术为数学工具。
6·The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
MSS 问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
7·In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graph partition problem.
在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。
8·By inserting a new set of medium vertices in a complete bipartite graph, we extend Pigeon-hole formula to general pigeon-hole formula.
鸽巢公式的一个真值指派可以用一个边带标记的完全二分图表示。
9·G is said to be bipartite matching extendable (BM-extendable) if every matching m whose induced subgraph is a bipartite graph extends to a perfect matching of g.
称g是偶匹配可扩的，如果G中导出子图是偶图的匹配m都可以扩充为g的完美匹配。
10·On the base of a variety of calculation of matrix used on the empowering bipartite graph, the solutions are further given to solve the linear equations in the graphs.
本文在赋权二部图上施行矩阵的各种运算之基础上，进一步给出用图求解线性方程组的方法。